Ddi2-jbc R2
نویسندگان
چکیده
CAPSULE Background: DDI2 and DDI3 are two uncharacterized identical genes found in budding yeast. Results: They encode novel cyanamide hydratases and are massively induced by cyanamide. Their deletion causes cellular sensitivity to cyanamide. Conclusion: The two genes function in cyanamide detoxification and are tightly regulated. Significance: This is the first attempt to understand the duplicated gene cluster in budding yeast.
منابع مشابه
The aspartyl protease DDI2 activates Nrf1 to compensate for proteasome dysfunction
In response to proteasome dysfunction, mammalian cells upregulate proteasome gene expression by activating Nrf1. Nrf1 is an endoplasmic reticulum-resident transcription factor that is continually retrotranslocated and degraded by the proteasome. Upon proteasome inhibition, Nrf1 escapes degradation and is cleaved to become active. However, the processing enzyme for Nrf1 remains obscure. Here we ...
متن کاملHuman DNA-Damage-Inducible 2 Protein Is Structurally and Functionally Distinct from Its Yeast Ortholog
Although Ddi1-like proteins are conserved among eukaryotes, their biological functions remain poorly characterized. Yeast Ddi1 has been implicated in cell cycle regulation, DNA-damage response, and exocytosis. By virtue of its ubiquitin-like (UBL) and ubiquitin-associated (UBA) domains, it has been proposed to serve as a proteasomal shuttle factor. All Ddi1-like family members also contain a hi...
متن کاملThe Journal of Biological Chemistry: 2016 Onward.
Scientific publishing has undergone massive change in the past two decades, and the landscape is shifting. The Journal of Biological Chemistry (JBC) must respond to this changing landscape, weighing what to preserve, what to emphasize, and how to be the best journal for a broad authorship/readership from across the globe. Simultaneously, we are witnessing truly stunning scientific advances and ...
متن کاملModular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite termination graphs which represent all possible runs of the program. Afterwards, the termination graphs are translated to term rewrite systems (TRSs) such that termination of the resulting TRSs implies termination of the origina...
متن کاملTermination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can be translated into “simple” formalisms like term rewriting and existing tools can be used to prove termination of the resulting term rewrite system (TRS). In this paper we show that termination graphs indeed capture ...
متن کامل